Continuous maximal covering location problems with interconnected facilities

In this paper we analyze a continuous version of the maximal covering location problem, in which facilities are required to be linked by means given graph structure (provided that two allowed if distance is not exceed). We propose mathematical programming framework for problem and different resolution strategies. First, provide Mixed Integer Non Linear Programming formulation derive some geometrical properties allow us reformulate it as an equivalent pure integer linear problem. branch-&-cut approaches relaxing sets constraints former formulation. also develop math-heuristic algorithm capable solve instances larger sizes. report results extensive battery computational experiments comparing performance approaches.